Application of Parametric Model Checking - The Root Contention Protocol
نویسندگان
چکیده
This paper presents an application of formal verification which was carried out using the new implemented version of the LPMC model checker tool [16]. The focus is on the modeling and the automatic verification of a protocol contained in the IEEE 1394 standard, the Root Contention protocol. The Root Contention protocol involves both realtime and randomization. As it will be shown, it is an illustrative case study which fully demonstrates the use of the new LPMC capability of handling linear constraints in order to exploit parametric real-time model checking.
منابع مشابه
Automatic Parametric Verification of Root Contention Protocol based on Abstract State Machines and First Order Timed Logic
The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new and innovative approach for the verification of real-time distributed systems. Systems are modeled with basic Gurevich abstract state machines (ASMs), and requirements are expressed in a first order timed logic (FOTL). FOTL is undecidable, however the protocol we study is in a decidable class of p...
متن کاملAutomatic Parametric Verification of a Root Contention Protocol Based on Abstract State Machines and First Order Timed Logic
The paper presents a verification of the IEEE Root Contention Protocol as an illustration of a new and innovative approach for the verification of real-time distributed systems. Systems are modeled with basic Gurevich abstract state machines (ASMs), and requirements are expressed in a first order timed logic (FOTL). FOTL is undecidable, however the protocol we study is in a decidable class of p...
متن کاملProved Development of the Real-Time Properties of the IEEE 1394 Root Contention Protocol with the Event B Method Root Contention Protocol with Event B
We present a model of the IEEE 1394 Root Contention Protocol with a proof of Safety. This model has real-time properties which are expressed in the language of the event B method: first-order classical logic and set theory. Verification is done by proof using the event B method and its prover, we also have a way to model-check models. Refinement is used to describe the studied system at differe...
متن کاملA short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملA Method for Designing Multimedia Protocols using Both Parametric Model Checking and Functional Testing
In this paper, we propose a method for designing multimedia protocols using both parametric model checking and functional testing. Especially, we focus on designing media synchronization protocols. We specify a given media synchronization protocol as concurrent periodic timed automata with temporal properties where QoS parameters of the underlying network and timing parameters of the protocol a...
متن کامل